7 research outputs found
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)
In the general AntiFactor problem, a graph G and, for every vertex v of G, a set X_v ? ? of forbidden degrees is given. The task is to find a set S of edges such that the degree of v in S is not in the set X_v. Standard techniques (dynamic programming plus fast convolution) can be used to show that if M is the largest forbidden degree, then the problem can be solved in time (M+2)^{tw}?n^{O(1)} if a tree decomposition of width tw is given. However, significantly faster algorithms are possible if the sets X_v are sparse: our main algorithmic result shows that if every vertex has at most x forbidden degrees (we call this special case AntiFactor_x), then the problem can be solved in time (x+1)^{O(tw)}?n^{O(1)}. That is, AntiFactor_x is fixed-parameter tractable parameterized by treewidth tw and the maximum number x of excluded degrees.
Our algorithm uses the technique of representative sets, which can be generalized to the optimization version, but (as expected) not to the counting version of the problem. In fact, we show that #AntiFactor? is already #W[1]-hard parameterized by the width of the given decomposition. Moreover, we show that, unlike for the decision version, the standard dynamic programming algorithm is essentially optimal for the counting version. Formally, for a fixed nonempty set X, we denote by X-AntiFactor the special case where every vertex v has the same set X_v = X of forbidden degrees. We show the following lower bound for every fixed set X: if there is an ? > 0 such that #X-AntiFactor can be solved in time (max X+2-?)^{tw}?n^{O(1)} given a tree decomposition of width tw, then the Counting Strong Exponential-Time Hypothesis (#SETH) fails
Probabilistic Metric Embedding via Metric Labeling
We consider probabilistic embedding of metric spaces into ultra-metrics (or equivalently to a constant factor, into hierarchically separated trees) to minimize the expected distortion of any pairwise distance. Such embeddings have been widely used in network design and online algorithms. Our main result is a polynomial time algorithm that approximates the optimal distortion on any instance to within a constant factor. We achieve this via a novel LP formulation that reduces this problem to a probabilistic version of uniform metric labeling
Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints
Matching problems with group-fairness constraints and diversity constraints
have numerous applications such as in allocation problems, committee selection,
school choice, etc. Moreover, online matching problems have lots of
applications in ad allocations and other e-commerce problems like product
recommendation in digital marketing.
We study two problems involving assigning {\em items} to {\em platforms},
where items belong to various {\em groups} depending on their attributes; the
set of items are available offline and the platforms arrive online. In the
first problem, we study online matchings with {\em proportional fairness
constraints}. Here, each platform on arrival should either be assigned a set of
items in which the fraction of items from each group is within specified bounds
or be assigned no items; the goal is to assign items to platforms in order to
maximize the number of items assigned to platforms.
In the second problem, we study online matchings with {\em diversity
constraints}, i.e. for each platform, absolute lower bounds are specified for
each group. Each platform on arrival should either be assigned a set of items
that satisfy these bounds or be assigned no items; the goal is to maximize the
set of platforms that get matched. We study approximation algorithms and
hardness results for these problems. The technical core of our proofs is a new
connection between these problems and the problem of matchings in hypergraphs.
Our experimental evaluation shows the performance of our algorithms on
real-world and synthetic datasets exceeds our theoretical guarantees.Comment: 16 pages, Full version of a paper accepted in ECAI 202
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs
We investigate how efficiently a well-studied family of domination-type
problems can be solved on bounded-treewidth graphs. For sets of
non-negative integers, a -set of a graph is a set of
vertices such that for every , and for every . The problem of finding a
-set (of a certain size) unifies standard problems such as
Independent Set, Dominating Set, Independent Dominating Set, and many others.
For all pairs of finite or cofinite sets , we determine (under
standard complexity assumptions) the best possible value such
that there is an algorithm that counts -sets in time
(if a tree decomposition of width
is given in the input). For example, for the Exact Independent
Dominating Set problem (also known as Perfect Code) corresponding to
and , we improve the
algorithm of [van Rooij, 2020] to .
Despite the unusually delicate definition of , we show that
our algorithms are most likely optimal, i.e., for any pair of
finite or cofinite sets where the problem is non-trivial, and any
, a -algorithm counting the number of -sets would violate
the Counting Strong Exponential-Time Hypothesis (#SETH). For finite sets
and , our lower bounds also extend to the decision version,
showing that our algorithms are optimal in this setting as well. In contrast,
for many cofinite sets, we show that further significant improvements for the
decision and optimization versions are possible using the technique of
representative sets
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth
In the General Factor problem, we are given an undirected graph G and for each vertex v ∈ V(G) a finite set B_v of non-negative integers. The task is to decide if there is a subset S ⊆ E(G) such that deg_S(v) ∈ B_v for all vertices v of G. Define the max-gap of a finite integer set B to be the largest d ≥ 0 such that there is an a ≥ 0 with [a,a+d+1] ∩ B = {a,a+d+1}. Cornuéjols showed in 1988 that if the max-gap of all sets B_v is at most 1, then the decision version of General Factor is polynomial-time solvable. This result was extended 2018 by Dudycz and Paluch for the optimization (i.e. minimization and maximization) versions. We present a general algorithm counting the number of solutions of a certain size in time (M+1)^{tw}n^{O(1)}, given a tree decomposition of width tw, where M is the maximum integer over all B_v. By using convolution techniques from van Rooij (2020), we improve upon the previous (M+1)^{3tw}n^{O(1)} time algorithm by Arulselvan et al. from 2018.
We prove that this algorithm is essentially optimal for all cases that are not trivial or polynomial time solvable for the decision, minimization or maximization versions. Our lower bounds show that such an improvement is not even possible for B-Factor, which is General Factor on graphs where all sets B_v agree with the fixed set B. We show that for every fixed B where the problem is NP-hard, our (max B+1)^{tw}n^{O(1)} algorithm cannot be significantly improved: assuming the Strong Exponential Time Hypothesis (SETH), no algorithm can solve B-Factor in time (max B+1-ε)^{tw}n^{O(1)} for any ε > 0. We extend this bound to the counting version of B-Factor for arbitrary, non-trivial sets B, assuming #SETH.
We also investigate the parameterization of the problem by cutwidth. Unlike for treewidth, having a larger set B does not appear to make the problem harder: we give a 2^{cutw}n^{O(1)} algorithm for any B and provide a matching lower bound that this is optimal for the NP-hard cases
アクセントの起源をめぐる小考 : または韻律論のために・続
This paper proposes an improved charge pump circuit for low voltage RFID applications. The architecture of charge transfer switch based dynamic charge pump has been modified to provide higher output voltage than existing one. This has been achieved by replacing the diode with a charge transfer block at the last stage of the dynamic CTS charge pump. The modified charge pump eliminates the threshold voltage loss and the effects of leakage currents. A 10-stage charge pump circuit with each pumping capacitance of 1pF is designed and simulated with an input voltage of 1V and clock frequency of 500MHz. The proposed charge-pump circuit is designed and simulated by Cadence virtuoso with UMC 0.18-μm CMOS technology parameters